Fully dynamic secret sharing schemes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fully Dynamic Secret Sharing Schemes

We consider secret sharing schemes in which the dealer is able (after a preprocessing stage) to activate a particular access structure out of a given set and/or to allow the participants to reconstruct diierent secrets (in diierent time instants) by sending them the same broadcast message. In this paper we establish a formal setting to study secret sharing schemes of this kind. The security of ...

متن کامل

Anonymous Secret Sharing Schemes

In this paper we study anonymous secret sharing schemes. Informally, in an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In such schemes the computation of the secret can be carried out by giving the shares to a black box that does not know the identities of the participants holding those shares. Phillips and Phillips ...

متن کامل

On Secret Sharing Schemes

The concept of secret sharing has been introduced independently by Shamir and Blakley, as a tool to protect a secret from getting exposed or from being lost. It allows a so-called dealer to share a secret among the members of a set P , which are usually called players or participants, in such a way that only certain specified subsets of players are able to reconstruct the secret while smaller s...

متن کامل

Compounding secret sharing schemes

In this paper we introduce the class of composite access structures for secret sharing. We also provide secret sharing schemes realizing these structures and study their information rates. As a particular case of this construction, we present the subclass of iterated threshold schemes, a large class of ideal secret sharing schemes.

متن کامل

Quantum Secret Sharing Schemes

Nascimento et al. [19] introduced a quantum information theoretical model for Quantum Secret Sharing (QSS) schemes. In this thesis, we describe existing schemes, such as the construction using Monotone Span Programs (MSPs) [16], according to this model. Moreover, the correctness of these schemes is proved in an information theoretical way. In particular, we consider the so-called pure state QSS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1996

ISSN: 0304-3975

DOI: 10.1016/0304-3975(96)00003-5